全文获取类型
收费全文 | 316篇 |
免费 | 90篇 |
国内免费 | 6篇 |
出版年
2023年 | 4篇 |
2021年 | 10篇 |
2020年 | 9篇 |
2019年 | 14篇 |
2018年 | 5篇 |
2017年 | 13篇 |
2016年 | 18篇 |
2015年 | 16篇 |
2014年 | 22篇 |
2013年 | 13篇 |
2012年 | 17篇 |
2011年 | 32篇 |
2010年 | 19篇 |
2009年 | 27篇 |
2008年 | 17篇 |
2007年 | 20篇 |
2006年 | 18篇 |
2005年 | 22篇 |
2004年 | 18篇 |
2003年 | 15篇 |
2002年 | 14篇 |
2001年 | 14篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 3篇 |
排序方式: 共有412条查询结果,搜索用时 578 毫秒
101.
We present a tactical decision model for order acceptance and capacity planning that maximizes the expected profits from accepted orders, allowing for aggregate regular as well as nonregular capacity. The stream of incoming order arrivals is the main source of uncertainty in dynamic order acceptance and the company only has forecasts of the main properties of the future incoming projects. Project proposals arrive sequentially with deterministic interarrival times and a decision on order acceptance and capacity planning needs to be made each time a proposal arrives and its project characteristics are revealed. We apply stochastic dynamic programming to determine a profit threshold for the accept/reject decision as well as to deterministically allocate a single bottleneck resource to the accepted projects, both with an eye on maximizing the expected revenues within the problem horizon. We derive a number of managerial insights based on an analysis of the influence of project and environmental characteristics on optimal project selection and aggregate capacity usage. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
102.
We consider a mixed‐model assembly line (MMAL) comprised a set of workstations and a conveyor. The workstations are arranged in a serial configuration. The conveyor moves at a constant speed along the workstations. Initial units belonging to different models are successively fed onto the conveyor, and they are moved by the conveyor to pass through the workstations to gradually generate final products. All assembling tasks are manually performed with operation times to be stochastic. An important performance measure of MMALs is overload times that refer to uncompleted operations for operators within their work zones. This paper establishes a method to analyze the expected overload times for MMALs with stochastic operation times. The operation processes of operators form discrete time nonhomogeneous Markov processes with continuous state spaces. For a given daily production schedule, the expected overload times involve in analyzing the Markov processes for finite horizon. Based on some important properties of the performance measure, we propose an efficient approach for calculating the expected overload times. Numerical computations show that the results are very satisfactory. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
103.
Yingdong Lu 《海军后勤学研究》2007,54(1):33-45
We investigate inventory management for a large‐scale multi‐product, multi‐component Assemble‐to‐Order system with general random batch demands. Results from extreme statistics theory are applied in developing approximation schemes for a widely used performance measure, customer backorders. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
104.
某新型榴弹引信加速寿命试验设计 总被引:1,自引:1,他引:0
通过对影响某新型榴弹引信长储失效的主要环境因素(温度和湿度)分析,得出其寿命服从威布尔分布,双环境应力下满足阿伦尼斯模型。用恒定应力加速寿命试验方法计算出双环境应力下威布尔分布的过渡参数、形状参数、尺寸参数等值,从而估算出某新型榴弹引信长储失效规律。 相似文献
105.
谢新艳 《国防科技大学学报》1999,21(6):119-122
讨论了一类多维双重时序AR(1)-MA(q)模型的二阶平稳性问题。通过导出一组线性方程组,给出了这类模型二阶平稳的显式充分条件和必要条件,为验证模型的二阶平稳性提供了一个可行的途径。 相似文献
106.
107.
Zhang Zhihua 《海军工程大学学报》1998,(2)
讨论了Weibul场合下恒定应力加速寿命试验的最优线性无偏估计及保序估计,获得了保序估计的表示式,并给出了一个模拟例子. 相似文献
108.
决策是C~3I 系统的核心问题之一。用Petri 网理论研究C~3I 系统的决策问题已取得了长足的进展。根据决策过程各阶段之所需时间具有随机性及不独立性的特点,以变迁发射时间不独立的随机Petri 网作为决策时延的建模与分析工具,并给出了这种随机Petri 网模型的一般分析方法。 相似文献
109.
The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
110.
分析了多个防空火力单元的作战过程,将战术BM/C3的控制协调决策抽象为决策策略。建立了多个火力单元协同作战的排队网络模型,并运用SPN理论对排队网络的运行机制进行了强有力的描述,有效地体现了防空作战过程中的威胁评估、目标分配等战术决策过程。这将为建立大型复杂排队网络,模拟仿真战役层面防空作战过程奠定基础。 相似文献